package com.example.leetcode.array;

import com.example.leetcode.array.common.ArrayUtils;

class Solution697 {
    public int findShortestSubArray(int[] nums) {
        return ArrayUtils.findShortestSubArray(nums);
    }
}

public class leetcode697 {
    public static void main(String[] args) {
        Solution697 solution697 = new Solution697();
        int[] nums = {1, 2, 2, 3, 3, 4, 3, 2};
        System.out.println(solution697.findShortestSubArray(nums));
    }
}
